Higher Order Quotients and their Implementation in Isabelle HOL
نویسنده
چکیده
This paper describes the concept of higher order quotients and an implementation in Isabelle Higher order quotients are a gen eralization of quotients They use partial equivalence relations PERs instead of equivalence relations to group together di erent elements This makes them applicable to arbitrary function spaces Higher order quo tients are conservatively implemented in the Isabelle logic HOL with a type constructor and a type class for PERs Ordinary quotients are a special case of higher order quotients An example shows how they can be used in Isabelle
منابع مشابه
Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL
Quotients, subtypes, and other forms of type abstraction are ubiquitous in formal reasoning with higher-order logic. Typically, users want to build a library of operations and theorems about an abstract type, but they want to write definitions and proofs in terms of a more concrete representation type, or “raw” type. Earlier work on the Isabelle Quotient package [3, 4] has yielded great progres...
متن کاملTypes, Abstraction and Parametric Polymorphism in Higher-Order Logic
Thinking and working abstractly has been one of the most fruitful instruments of modern society. This thesis aims to promote types as a powerful tool for abstraction in the interactive theorem prover Isabelle/HOL by making them definitional and easy to use. In order to keep our prover trustworthy, we are allowed to define new types on the logical level by only one elementary rule. Our first con...
متن کاملSet Theory or Higher Order Logic to Represent Auction Concepts in Isabelle?
When faced with the question of how to represent properties in a formal proof system any user has to make design decisions. We have proved three of the theorems from Maskin’s 2004 survey article on Auction Theory using the Isabelle/HOL system, and we have verified software code that implements combinatorial Vickrey auctions. A fundamental question in this was how to represent some basic concept...
متن کاملCombining WS1S and HOL
We investigate the combination of the weak second-order monadic logic of one successor (WS1S) with higher-order logic (HOL). We show how these two logics can be combined, how theorem provers based on them can be safely integrated, and how the result can be used. In particular, we present an embedding of the semantics of WS1S in HOL that provides a basis for coupling the MONA system, a decision ...
متن کاملA Corrected Failure Divergence Model for CSP in Isabelle/HOL
We present a failure-divergence model for CSP following the concepts of [BR 85]. Its formal representation within higher order logic in the theorem prover Isabelle/HOL [Pau 94] revealed an error in the basic definition of CSP concerning the treatment of the termination symbol tick. A corrected model has been formally proven consistent with Isabelle/HOL. Moreover, the changed version maintains t...
متن کامل